Schrödinger operators on graphs: Symmetrization and Eulerian cycles
نویسندگان
چکیده
منابع مشابه
Counting Invertible Schrödinger Operators over Finite Fields for Trees, Cycles and Complete Graphs
We count invertible Schrödinger operators (perturbations by diagonal matrices of the adjacency matrix) over finite fields for trees, cycles and complete graphs. This is achieved for trees through the definition and use of local invariants (algebraic constructions of perhaps independent interest). Cycles and complete graphs are treated by ad hoc methods.
متن کاملJu l 2 00 6 Schrödinger operators on zigzag graphs
We consider the Schrödinger operator on zigzag graphs with a periodic potential. The spectrum of this operator consists of an absolutely continuous part (intervals separated by gaps) plus an infinite number of eigenvalues with infinite multiplicity. We describe all compactly supported eigenfunctions with the same eigenvalue. We define a Lyapunov function, which is analytic on some Riemann surfa...
متن کاملClustered Planarity: Small Clusters in Cycles and Eulerian Graphs
We present several polynomial-time algorithms for c-planarity testing for cluster hierarchy C containing clusters of size at most three. The main result is an O(|C| + n)-time algorithm for clusters of size at most three on a cycle. The result is then generalized to a special class of Eulerian graphs, namely graphs obtained from a 3-connected planar graph of fixed size k by multiplying and then ...
متن کاملOn cycles in intersection graphs of rings
Let $R$ be a commutative ring with non-zero identity. We describe all $C_3$- and $C_4$-free intersection graph of non-trivial ideals of $R$ as well as $C_n$-free intersection graph when $R$ is a reduced ring. Also, we shall describe all complete, regular and $n$-claw-free intersection graphs. Finally, we shall prove that almost all Artin rings $R$ have Hamiltonian intersection graphs. ...
متن کاملOn Making Directed Graphs Eulerian
A directed graph is called Eulerian, if it contains a tour that traverses every arc in the graph exactly once. We study the problem of Eulerian Extension (EE) where a directed multigraph G and a weight function is given and it is asked whether G can be made Eulerian by adding arcs whose total weight does not exceed a given threshold. This problem is motivated through applications in vehicle rou...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of the American Mathematical Society
سال: 2015
ISSN: 0002-9939,1088-6826
DOI: 10.1090/proc12784